A novel nonsymmetric K−-Lanczos algorithm for the generalized nonsymmetric K−-eigenvalue problems
نویسندگان
چکیده
منابع مشابه
Restarting the Nonsymmetric Lanczos Algorithm
A restarted nonsymmetric Lanczos algorithm is given for computing eigenvalus and both right and left eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Restarting also makes it possible to deal with roundoff error in new ways. We give a scheme for avoiding near-breakdown and discuss maintaining biorthogonality. A system of linear equations can be solved s...
متن کاملA Parallel Algorithm for the Nonsymmetric Eigenvalue Problems
This paper presents a parallel algorithm to solve the eigenvalue problem for non-symmetric matrices. The idea of homotopy is used to generate initial approximations, then the Aberth method and our modiied Aberth method are used to nd simultaneously all the eigenvalues. The advantage of this approach is that multiple eigenvalues can be handled. In addition, the multiplicities of the eigenvalues ...
متن کاملHomotopy-determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems
The eigenvalues of a matrix A are the zeros of its characteristic polynomial fiX) = dtt[A XI]. With Hyman's method of determinant evaluation, a new homotopy continuation method, homotopy-determinant method, is developed in this paper for finding all eigenvalues of a real upper Hessenberg matrix. In contrast to other homotopy continuation methods, the homotopy-determinant method calculates eigen...
متن کاملError Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
This paper presents an error analysis of the Lanczos algorithm in finite-precision arithmetic for solving the standard nonsymmetric eigenvalue problem, if no breakdown occurs. An analog of Paige's theory on the relationship between the loss of orthogonality among the Lanczos vectors and the convergence of Ritz values in the symmetric Lanczos algorithm is discussed. The theory developed illustra...
متن کاملA Convergence Analysis for Nonsymmetric Lanczos Algorithms
A convergence analysis for the nonsymmetric Lanczos algorithm is presented. By using a tridiagonal structure of the algorithm, some identities concerning Ritz values and Ritz vectors are established and used to derive approximation bounds. In particular, the analysis implies the classical results for the symmetric Lanczos algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1997
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(96)00670-2